0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.15/0.36 % Computer : n015.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1200 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Jul 13 14:20:19 EDT 2021 0.15/0.36 % CPUTime : 0.15/0.36 % Number of cores: 8 0.15/0.37 % Python version: Python 3.6.8 0.15/0.37 # Version: 2.6rc1-ho 0.22/0.38 # No SInE strategy applied 0.22/0.38 # Trying AutoSched0 for 59 seconds 0.22/0.50 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.22/0.50 # and selection function SelectMaxLComplexAvoidPosPred. 0.22/0.50 # 0.22/0.50 # Preprocessing time : 0.051 s 0.22/0.50 0.22/0.50 # Proof found! 0.22/0.50 # SZS status Theorem 0.22/0.50 # SZS output start CNFRefutation 0.22/0.50 thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)). 0.22/0.50 thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)). 0.22/0.50 thf(def_n_is, axiom, (n_is)=(^[X399:$i, X400:$i]:(X399)=(X400)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)). 0.22/0.50 thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)). 0.22/0.50 thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)). 0.22/0.50 thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)). 0.22/0.50 thf(def_nis, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_nis)). 0.22/0.50 thf(ordsucc_inj, axiom, ![X1:$i, X118:$i]:((X1)=(X118)<=(ordsucc @ X1)=(ordsucc @ X118)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', ordsucc_inj)). 0.22/0.50 thf(satz1, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X172:$i]:in @ X172 @ nat) @ (^[X173:$i]:(nis @ X1 @ X173=>nis @ (ordsucc @ X1) @ (ordsucc @ X173)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz1)). 0.22/0.50 thf(c_0_9, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])). 0.22/0.50 thf(c_0_10, axiom, (n_is)=(^[X399:$i, X400:$i]:(X399)=(X400)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])). 0.22/0.50 thf(c_0_11, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])). 0.22/0.50 thf(c_0_12, axiom, (nis)=(^[X1:$i, X113:$i]:((X1)=(X113)=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_nis, c_0_9]), c_0_10])). 0.22/0.50 thf(c_0_13, plain, ![X1:$i, X118:$i]:((ordsucc @ X1)=(ordsucc @ X118)=>(X1)=(X118)), inference(fof_simplification,[status(thm)],[ordsucc_inj])). 0.22/0.50 thf(c_0_14, negated_conjecture, ~(![X572:$i]:(in @ X572 @ nat=>![X576:$i]:(in @ X576 @ nat=>((X572)!=(X576)=>(ordsucc @ X572)!=(ordsucc @ X576))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz1]), c_0_11]), c_0_12])])). 0.22/0.50 thf(c_0_15, plain, ![X750:$i, X751:$i]:((ordsucc @ X750)!=(ordsucc @ X751)|(X750)=(X751)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])). 0.22/0.50 thf(c_0_16, negated_conjecture, (in @ esk38_0 @ nat&(in @ esk39_0 @ nat&((esk38_0)!=(esk39_0)&(ordsucc @ esk38_0)=(ordsucc @ esk39_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])). 0.22/0.50 thf(c_0_17, plain, ![X1:$i, X4:$i]:((X1)=(X4)|(ordsucc @ X1)!=(ordsucc @ X4)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.22/0.50 thf(c_0_18, negated_conjecture, (ordsucc @ esk38_0)=(ordsucc @ esk39_0), inference(split_conjunct,[status(thm)],[c_0_16])). 0.22/0.50 thf(c_0_19, negated_conjecture, ![X1:$i]:((X1)=(esk38_0)|(ordsucc @ X1)!=(ordsucc @ esk39_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.22/0.50 thf(c_0_20, negated_conjecture, (esk38_0)!=(esk39_0), inference(split_conjunct,[status(thm)],[c_0_16])). 0.22/0.50 thf(c_0_21, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_19]), c_0_20]), ['proof']). 0.22/0.50 # SZS output end CNFRefutation 0.22/0.50 # Proof object total steps : 22 0.22/0.50 # Proof object clause steps : 5 0.22/0.50 # Proof object formula steps : 17 0.22/0.50 # Proof object conjectures : 7 0.22/0.50 # Proof object clause conjectures : 4 0.22/0.50 # Proof object formula conjectures : 3 0.22/0.50 # Proof object initial clauses used : 3 0.22/0.50 # Proof object initial formulas used : 9 0.22/0.50 # Proof object generating inferences : 2 0.22/0.50 # Proof object simplifying inferences : 1 0.22/0.50 # Training examples: 0 positive, 0 negative 0.22/0.50 # Parsed axioms : 284 0.22/0.50 # Removed by relevancy pruning/SinE : 0 0.22/0.50 # Initial clauses : 386 0.22/0.50 # Removed in clause preprocessing : 130 0.22/0.50 # Initial clauses in saturation : 256 0.22/0.50 # Processed clauses : 269 0.22/0.50 # ...of these trivial : 7 0.22/0.50 # ...subsumed : 10 0.22/0.50 # ...remaining for further processing : 252 0.22/0.50 # Other redundant clauses eliminated : 111 0.22/0.50 # Clauses deleted for lack of memory : 0 0.22/0.50 # Backward-subsumed : 0 0.22/0.50 # Backward-rewritten : 3 0.22/0.50 # Generated clauses : 2176 0.22/0.50 # ...of the previous two non-trivial : 2000 0.22/0.50 # Contextual simplify-reflections : 0 0.22/0.50 # Paramodulations : 1893 0.22/0.50 # Factorizations : 0 0.22/0.50 # NegExts : 0 0.22/0.50 # Equation resolutions : 122 0.22/0.50 # Propositional unsat checks : 0 0.22/0.50 # Propositional check models : 0 0.22/0.50 # Propositional check unsatisfiable : 0 0.22/0.50 # Propositional clauses : 0 0.22/0.50 # Propositional clauses after purity: 0 0.22/0.50 # Propositional unsat core size : 0 0.22/0.50 # Propositional preprocessing time : 0.000 0.22/0.50 # Propositional encoding time : 0.000 0.22/0.50 # Propositional solver time : 0.000 0.22/0.50 # Success case prop preproc time : 0.000 0.22/0.50 # Success case prop encoding time : 0.000 0.22/0.50 # Success case prop solver time : 0.000 0.22/0.50 # Current number of processed clauses : 242 0.22/0.50 # Positive orientable unit clauses : 67 0.22/0.50 # Positive unorientable unit clauses: 3 0.22/0.50 # Negative unit clauses : 8 0.22/0.50 # Non-unit-clauses : 164 0.22/0.50 # Current number of unprocessed clauses: 1987 0.22/0.50 # ...number of literals in the above : 7420 0.22/0.50 # Current number of archived formulas : 0 0.22/0.50 # Current number of archived clauses : 3 0.22/0.50 # Clause-clause subsumption calls (NU) : 8459 0.22/0.50 # Rec. Clause-clause subsumption calls : 2921 0.22/0.50 # Non-unit clause-clause subsumptions : 9 0.22/0.50 # Unit Clause-clause subsumption calls : 409 0.22/0.50 # Rewrite failures with RHS unbound : 2 0.22/0.50 # BW rewrite match attempts : 12 0.22/0.50 # BW rewrite match successes : 5 0.22/0.50 # Condensation attempts : 0 0.22/0.50 # Condensation successes : 0 0.22/0.50 # Termbank termtop insertions : 61454 0.22/0.51 0.22/0.51 # ------------------------------------------------- 0.22/0.51 # User time : 0.127 s 0.22/0.51 # System time : 0.011 s 0.22/0.51 # Total time : 0.138 s 0.22/0.51 # Maximum resident set size: 2028 pages 0.22/0.51 EOF